Human agents draw a variety of inferences effortlessly, spontaneously, and with remarkable efficiency – as though these inferences were a reflexive response of their cognitive apparatus. Furthermore, these inferences are drawn with reference to a large body of background knowledge. This remarkable human ability seems paradoxical given the complexity of reasoning reported by researchers in artificial intelligence. It also poses a challenge for cognitive science and computational neuroscience: How can a system of simple and slow neuronlike elements represent a large (...) body of systemic knowledge and perform a range of inferences with such speed? We describe a computational model that takes a step toward addressing the cognitive science challenge and resolving the artificial intelligence paradox. We show how a connectionist network can encode millions of facts and rules involving n-ary predicates and variables and perform a class of inferences in a few hundred milliseconds. Efficient reasoning requires the rapid representation and propagation of dynamic bindings. Our model (which we refer to as SHRUTI) achieves this by representing (1) dynamic bindings as the synchronous firing of appropriate nodes, (2) rules as interconnection patterns that direct the propagation of rhythmic activity, and (3) long-term facts as temporal pattern-matching subnetworks. The model is consistent with recent neurophysiological evidence that synchronous activity occurs in the brain and may play a representational role in neural information processing. The model also makes specific psychologically significant predictions about the nature of reflexive reasoning. It identifies constraints on the form of rules that may participate in such reasoning and relates the capacity of the working memory underlying reflexive reasoning to biological parameters such as the lowest frequency at which nodes can sustain synchronous oscillations and the coarseness of synchronization. (shrink)

Contributed seminar papers presented at Seminar on the subject of Siddhantavada, organized by Department of Nyayavaisheshika, Shri Lalbahadur Shastri Kendriya Sanskrit Vidyapeeth, New Delhi in 2016.

Language and languages; linguistics; Arabic language; sufism.

The Stanford Encyclopedia of Philosophy is an open access, dynamic reference work designed to organize professional philosophers so that they can write, edit, and maintain a reference work in philosophy that is responsive to new research. From its inception, the SEP was designed so that each entry is maintained and kept up to date by an expert or group of experts in the field. All entries and substantive updates are refereed by the members of a distinguished Editorial Board before they (...) are made public. (shrink)

Study of Tattvacintāmaṇididhiti of Raghunātha Śiromaṇi, commentary on Pakṣatā, portion of Tattvacintāmaṇi of Gaṅgeśa, dealing with the essential nature of proposition (pakṣatā), of Navya Nyāya school in Hindu philosophy.

Although the connectionist approach has lead to elegant solutions to a number of problems in cognitive science and artificial intelligence, its suitability for dealing with problems in knowledge representation and inference has often been questioned. This paper partly answers this criticism by demonstrating that effective solutions to certain problems in knowledge representation and limited inference can be found by adopting a connectionist approach. The paper presents a connectionist realization of semantic networks, that is, it describes how knowledge about concepts, their (...) properties, and the hierarchical relationship between them may be encoded as an interpreter‐free massively parallel network of simple processing elements that can solve an interesting class of inheritance and recognition problems extremely fast—in time proportional to the depth of the conceptual hierarchy. The connectionist realization is based on an evidential formulation that leads to principled solutions to the problems of exceptions and conflicting multiple inheritance situations during inheritance, and the best‐match or partial‐match computation during recognition. The paper also identifies constraints that must be satisfied by the conceptual structure in order to arrive at an efficient parallel realization. (shrink)

Vol. presents a method for critically evaluating relevance in arguments based on case studies & a new relevance theory incorporating techniques of argumentation theory, logic & artificiaI intelligence. For scholars/students in argumentation & rhetoric.

When making decisions, humans can observe many kinds of information about others' activities, but their effects on performance are not well understood. We investigated social learning strategies using a simple problem-solving task in which participants search a complex space, and each can view and imitate others' solutions. Results showed that participants combined multiple sources of information to guide learning, including payoffs of peers' solutions, popularity of solution elements among peers, similarity of peers' solutions to their own, and relative payoffs from (...) individual exploration. Furthermore, performance was positively associated with imitation rates at both the individual and group levels. When peers' payoffs were hidden, popularity and similarity biases reversed, participants searched more broadly and randomly, and both quality and equity of exploration suffered. We conclude that when peers' solutions can be effectively compared, imitation does not simply permit scrounging, but it can also facilitate propagation of good solutions for further cumulative exploration. (shrink)